Research on Ordinal Properties in Combinatorics Coding Method

نویسندگان

  • Jun Lu
  • Tong Wang
  • Daxin Liu
چکیده

Combinatorics coding is a new data coding method based on combinatorics. Ordinal computing is the core technology of in the combinatorics coding. Ordinal properties of combinatorics coding is studied in this paper. Firstly, the combinatorics coding theory and the correlative basic concepts are described. Then, the properties of the ordinal are revealed. The study indicates that the value of ordinal have a close relationship with the selection of benchmark sequence. The size of ordinal is correlative with the distributing of character frequency in the sequence.The length of the sequence should be longer than the length of the ordinal and this conclude is proved by the theory. Moreover, the difference of the initial sequence length and the whole max ordinal length is increased along with the increase of the initial sequence length pvoved by the experiment and theory. The research on ordinal properties is of great significance to the development of the combinatorics coding technology.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Modeling and Analysis of Security Protocols Using Colored Petri Nets Yang Xu and Xiaoyao Xie COTS and Design Pattern Based High Fidelity Flight Simulator Prototype System

SPECIAL ISSUE PAPERS A Micro-Kernel Test Engine for Automatic Test System Shuai Wang, Yindong Ji, and Shiyuan Yang Research on Algorithm for Consistent Fit or Unfit Sorting Sector and Match Measurement between Plan and Environment Qihai Zhou and Yan Li Modeling and Analysis of Security Protocols Using Colored Petri Nets Yang Xu and Xiaoyao Xie COTS and Design Pattern Based High Fidelity Flight ...

متن کامل

Analytic combinatorics, proof-theoretic ordinals, and phase transitions for independence results

This paper is intended to give for a general mathematical audience (including non logicians) a survey about intriguing connections between analytic combinatorics and logic. We define the ordinals below ε0 in non-logical terms and we survey a selection of recent results about the analytic combinatorics of these ordinals. Using a versatile and flexible (logarithmic) compression technique we give ...

متن کامل

On the Length of the Wadge Hierarchy of Omega-Context Free Languages

We prove in this paper that the length of the Wadge hierarchy of ω-context free languages is greater than the Cantor ordinal εω, which is the ω th fixed point of the ordinal exponentiation of base ω. We show also that there exist some Σ0ω-complete ω-context free languages, improving previous results on ω-context free languages and the Borel hierarchy.

متن کامل

The Field of the Reals and the Random Graph are not Finite-Word Ordinal-Automatic

Recently, Schlicht and Stephan lifted the notion of automatic-structures to the notion of (finite-word) ordinal-automatic structures. These are structures whose domain and relations can be represented by automata reading finite words whose shape is some fixed ordinal α. We lift Delhommé’s relative-growth-technique from the automatic and tree-automatic setting to the ordinal-automatic setting. T...

متن کامل

Discrete Isoperimetric Inequalities And The Probability Of A Decoding Error

We derive improved isoperimetric inequalities for discrete product measures on the n-dimensional cube. As a consequence, a general theorem on the threshold behaviour of monotone properties is obtained. This is then applied to coding theory when we study the probability of error after decoding.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • JCP

دوره 6  شماره 

صفحات  -

تاریخ انتشار 2011